Kruskal's condition for uniqueness in Candecomp/Parafac when ranks and k

نویسندگان

  • Alwin Stegeman
  • Jos M. F. ten Berge
چکیده

A key feature of the analysis of three-way arrays by Candecomp/Parafac is the essential uniqueness of the trilinear decomposition. Kruskal has previously shown that the three component matrices involved are essentially unique when the sum of their k-ranks is at least twice the rank of the decomposition plus 2. It was proved that Kruskal’s sufficient condition is also necessary when the rank of the decomposition is 2 or 3. If the rank is 4 or higher, the condition is not necessary for uniqueness. However, when the k-ranks of the component matrices equal their ranks, necessity of Kruskal’s condition still holds in the rank-4 case. Ten Berge and Sidiropoulos conjectured that Kruskal’s condition is necessary for all cases of rank 4 and higher where ranks and k-ranks coincide. In the present paper we show that this conjecture is false. © 2004 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Kruskal’s uniqueness condition for the Candecomp/Parafac decomposition

Let X be a real-valued three-way array. The Candecomp/Parafac (CP) decomposition is written as X = Y(1) + · · · + Y(R) + E, where Y(r) are rank-1 arrays and E is a rest term. Each rank-1 array is defined by the outer product of three vectors a(r),b(r) and c(r), i.e. y ijk = a i b (r) j c (r) k . These vectors make up the R columns of the component matrices A, B and C. If 2R + 2 is less than or ...

متن کامل

An Algebraic Solution for the Candecomp/PARAFAC Decomposition with Circulant Factors

The Candecomp/PARAFAC decomposition (CPD) is an important mathematical tool used in several fields of application. Yet, its computation is usually performed with iterative methods which are subject to reaching local minima and to exhibiting slow convergence. In some practical contexts, the data tensors of interest admit decompositions constituted by matrix factors with particular structure. Oft...

متن کامل

Décomposition tensorielle de signaux luminescents émis par des biosenseurs bactériens pour l'identification de Systèmes Métaux-Bactéries

In this paper we investigate the uniqueness of the 4-way CANDECOMP/PARAFAC (CP) model in the case where the only possible linear dependencies between the columns of the loading matrices take the form of collinear loadings. For this special configuration we state a necessary and sufficient condition for having full column rank of the Khatri-Rao product of two loading matrices. This allows to der...

متن کامل

Three-mode factor analysis by means of Candecomp/Parafac.

A three-mode covariance matrix contains covariances of N observations (e.g., subject scores) on J variables for K different occasions or conditions. We model such an JK×JK covariance matrix as the sum of a (common) covariance matrix having Candecomp/Parafac form, and a diagonal matrix of unique variances. The Candecomp/Parafac form is a generalization of the two-mode case under the assumption o...

متن کامل

Multilinear operators for higher-order decompositions

We propose two new multilinear operators for expressing the matrix compositions that are needed in the Tucker and PARAFAC (CANDECOMP) decompositions. The first operator, which we call the Tucker operator, is shorthand for performing an n-mode matrix multiplication for every mode of a given tensor and can be employed to consisely express the Tucker decomposition. The second operator, which we ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2006